The Good Old Davis-Putnam Procedure Helps Counting Models
نویسندگان
چکیده
منابع مشابه
The Good Old Davis-Putnam Procedure Helps Counting Models
As was shown recently, many important AI problems require counting the number of models of propositional formulas. The problem of counting models of such formulas is, according to present knowledge, computationally intractable in a worst case. Based on the Davis-Putnam procedure, we present an algorithm, CDP, that computes the exact number of models of a propositional CNF or DNF formula F. Let ...
متن کاملDirectional Resolution: The Davis-Putnam Procedure, Revisited
The paper presents algorithm directional resolution, a variation on the original DavisPutnam algorithm, and analyzes its worstcase behavior as a function of the topological structure of the theories. The notions of induced width and diversity are shown to play a key role in bounding the complexity of the procedure. The importance of our analysis lies in highlighting structure-based tractable cl...
متن کاملIntegrating Equivalency Reasoning into Davis-Putnam Procedure
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam (DP) procedure. We propose a special look-ahead technique called equivalency reasoning to overcome the obstacle and report on the performance of an equivalency reasoning enhanced DP procedure on SAT instances containi...
متن کاملOrdered Binary Decision Diagrams and the Davis-Putnam Procedure
We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the Davis-Putnam procedure. Experimental results indicate that the Davis-Putnam procedure outperforms obdds in hard constraint-satisfaction problems, while obdds are clearly superior for Boolean functional equivalence problems from the circuit domain, and, in general, problems that...
متن کاملOn the Advantage of a Non-Clausal Davis-Putnam Procedure
We propose a non-clausal decision procedure for classical propositional logic. It is a generalization of the Davis-Putnam procedure and deals with formulae which are not necessarily in clausal form. Since there is no need to translate the investigated formula into normal form, we avoid increasing its size but preserve its structure. This will in general lead to a much smaller search space and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1999
ISSN: 1076-9757
DOI: 10.1613/jair.601